Compiler-directed scratchpad memory management via graph coloring
نویسندگان
چکیده
منابع مشابه
WCET-Driven Dynamic Data Scratchpad Management With Compiler-Directed Prefetching
In recent years, the real-time community has produced a variety of approaches targeted at managing on-chip memory (scratchpads and caches) in a predictable way. However, to obtain safe WCET bounds, such techniques generally assume that the processor is stalled while waiting to reload the content of the on-chip memory; hence, they are less effective at hiding main memory latency compared to spec...
متن کاملRegister Allocation via Chordal Graph Coloring for a HOT Compiler
[Note: this is an early draft of this write-up. A more polished version with citations and so forth is on the way shortly.] The problem of creating efficient type-preserving compilers for programming langauges with higherorder functions and rich type systems (HOT) has been studied with great interest in recent years, particularly at CMU. In Fall 2005, a course on HOT Compilation was offered for...
متن کاملAsymmetric directed graph coloring games
This note generalizes the (a, b)-coloring game and the (a, b)-marking game which were introduced by Kierstead [7] for undirected graphs to directed graphs. We prove that the (a, b)-chromatic and (a, b)-coloring number for the class of orientations of forests is b + 2 if b ≤ a, and infinity otherwise. From these results we deduce upper bounds for the (a, b)-coloring number of oriented outerplana...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولScalable, Shared Memory Parallel Graph Coloring Heuristics
Finding a good graph coloring quickly is often a crucial phase in the development of eecient, parallel algorithms for many scientiic and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost line...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2009
ISSN: 1544-3566,1544-3973
DOI: 10.1145/1582710.1582711